Ordered Subrings of the Reals in Which Output Sets Are Recursively Enumerable
نویسندگان
چکیده
In On a theory of computation and complexity over the real numbers ... , Bull. Amer. Math. Soc. 21 (1989), 1-46, Blum, Shub, and Smale investigated computability over the reals and over ordered rings in general. They showed that over the reals, output sets of machines are recursively enumerable (i.e., halting sets of machines). It is asked in the aforementioned paper which ordered rings have this property (which we abbreviate O = R.E.). In Ordered rings over which output sets are recursively enumerable, Proc. Amer. Math. Soc. 112 (1991), 569-575, Michaux characterized the members of a certain class of ordered rings of infinite transcendence degree over Q satisfying O = R.E. In this paper we characterize the subrings of R of finite transcendence degree over Q satisfying O = R.E. as those rings recursive in the Dedekind cuts of members of a transcendence base. With Michaux's result, this answers the question for subrings of R (i.e., archimedean rings).
منابع مشابه
Universal computably enumerable sets and initial segment prefix-free complexity
We show that there are Turing complete computably enumerable sets of arbitrarily low non-trivial initial segment prefix-free complexity. In particular, given any computably enumerable set A with non-trivial prefixfree initial segment complexity, there exists a Turing complete computably enumerable set B with complexity strictly less than the complexity of A. On the other hand it is known that s...
متن کاملRandomness and Recursive Enumerability
One recursively enumerable real α dominates another one β if there are nondecreasing recursive sequences of rational numbers (a[i] : i ∈ ω) approximating α and (b[i] : i ∈ ω) approximating β and a positive constant C such that for all n, C(α−a[n]) ≥ (β−b[n]). See [Solovay, 1975] and [Chaitin, 1977]. We show every recursively enumerable random real dominates all other recursively enumerable real...
متن کاملDegrees of Weakly Computable Reals
A real α is left-recursively enumerable (left-r.e. for short) if we can effectively generate α from below. That is, the left Dedkind cut of α, L(α) = {q ∈ Q : q ≤ α}, forms a r.e. set. Equivalently, a real α is left-r.e. if it is the limit of a converging recursive increasing sequence. If we can also compute the radius of convergence effectively, then α is recursive. Left-r.e. reals are the mea...
متن کاملCreative Objectivism, a powerful alternative to Constructivism
It is problematic to allow reasoning about infinite sets to be as unconstrained as that about finite sets. Yet Constructivism seems too restrictive in not allowing one to assume that an ideal computer program will either halt or not halt. Creative Objectivism considers as meaningful any property of integers which is determined by a recursively enumerable set of events. This captures the hyperar...
متن کاملRelative randomness and real closed fields
We show that for any real number, the class of real numbers less random than it, in the sense of rK-reducibility, forms a countable real closed subfield of the real ordered field. This generalizes the well-known fact that the computable reals form a real closed field. With the same technique we show that the class of differences of computably enumerable reals (d.c.e. reals) and the class of com...
متن کامل